Probabilistic rely-guarantee calculus

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic rely-guarantee calculus

Jones’ rely-guarantee calculus [1] for shared variable concurrency is extended to include probabilistic behaviours. We use an algebraic approach which combines and adapts probabilistic Kleene algebras with concurrent Kleene algebra. Soundness of the algebra is shown relative to a general probabilistic event structure semantics [21]. The main contribution of this paper is a collection of rely-gu...

متن کامل

On Rely-Guarantee Reasoning

Many semantic models of rely-guarantee have been proposed in the literature. This paper proposes a new classification of the approaches into two groups based on their treatment of guarantee conditions. To allow a meaningful comparison, it constructs an abstract model for each group in a unified setting. The first model uses a weaker judgement and supports more general rules for atomic commands ...

متن کامل

Rely-Guarantee View Typestate

The combination of mutable state and pointer aliasing is often troublesome due to non-obvious (and usually unspecified) interferences that may occur between non-local parts of the program. We present a type-based approach to statically control aliasing and mutable state in a minimalistic single-threaded procedural language with support for structures and references. By introducing views, re-com...

متن کامل

Refining rely-guarantee thinking

Reasoning about concurrent programs can be very difficult due to the possibility of interference. The fundamental insight of Rely-Guarantee thinking is that developing concurrent designs can only be made compositional if the development method offers ways to record and reason about the interference that is inherent in concurrency. The original presentation of rely-guarantee rules used keywords ...

متن کامل

Rely-Guarantee Protocols

The use of shared mutable state, commonly seen in object-oriented systems, is often problematic due to the potential conflicting interactions between aliases to the same state. We present a substructural type system outfitted with a novel lightweight interference control mechanism, rely-guarantee protocols, that enables controlled aliasing of shared resources. By assigning each alias separate r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2016

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2016.01.016